Proposed Heuristic Method for Solving Assignment Problems
نویسندگان
چکیده
منابع مشابه
Ones Assignment Method for Solving Assignment Problems
Assignment problem is an important subject discussed in real physical world. We endeavor in this paper to introduce a new approach to assignment problem namely, ones assignment method, for solving a wide rang of such problems. This method offers significant advantages over similar methods, in the process, first we define the assignment matrix, then by using determinant representation we obtain ...
متن کاملA New Approach for Solving Grey Assignment Problems
Linear assignment problem is one of the most important practical models in the literature of linear programming problems. Input data in the cost matrix of the linear assignment problem are not always crisp and sometimes in the practical situations is formulated by the grey systems theory approach. In this way, some researchers have used a whitening technique to solve the grey assignment p...
متن کاملA New Method for Solving Fuzzy Assignment Problems
Abstract. A new method namely, parallel moving method is proposed to find an optimal solution to the fuzzy assignment problem considered in Lin and Wen [13]. We derive two theorems; one is related to an optimal solution to the fuzzy assignment problem and another is related to find an improved solution from the current solution to the fuzzy assignment problem. The parallel moving method provide...
متن کاملSolving Quadratic Assignment Problems
We describe a branch-and-bound algorithm for the quadratic assignment problem (QAP) that uses a convex quadratic programming (QP) relaxation to obtain a bound at each node. The QP subproblems are approximately solved using the Frank-Wolfe algorithm, which in this case requires the solution of a linear assignment problem on each iteration. Our branching strategy makes extensive use of dual infor...
متن کاملDiscovering Heuristic Strategy for Solving Scheduling Problems
Optimally solving a scheduling problem is computationally intractable, hence varieties of techniques and methods have been explored to obtain sub-optimal solutions to such problems. In this paper we introduce a technique that effectively combines appropriate heuristics so as to find a quality solution when used with a hill climbing algorithm. We will demonstrate the proposed approach by applyin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Operations Research
سال: 2016
ISSN: 2160-8830,2160-8849
DOI: 10.4236/ajor.2016.66040